Lapped transforms and hidden Markov models for seismic data filtering

International audienceSeismic exploration provides information about the ground substructures. Seismic images are generally corrupted by several noise sources. Hence, efficient denoising procedures are required to improve the detection of essential geological information. Wavelet bases provide sparse representation for a wide class of signals and images. This property makes them good candidates for efficient filtering tools, allowing the separation of signal and noise coefficients. Recent works have improved their performance by modelling the intra- and inter-scale coefficient dependencies using hidden Markov models, since image features tend to cluster and persist in the wavelet domain. This work focuses on the use of lapped transforms associated with hidden Markov modelling. Lapped transforms are traditionally viewed as block-transforms, composed of M pass-band filters. Seismic data present oscillatory patterns and lapped transforms oscillatory bases have demonstrated good performances for seismic data compression. A dyadic like representation of lapped transform coefficient is possible, allowing a wavelet-like modelling of coefficients dependencies. We show that the proposed filtering algorithm often outperforms the wavelet performance both objectively (in terms of SNR) and subjectively: lapped transform better preserve the oscillatory features present in seismic data at low to moderate noise levels

A constrained-based optimization approach for seismic data recovery problems

Random and structured noise both affect seismic data, hiding the reflections of interest (primaries) that carry meaningful geophysical interpretation. When the structured noise is composed of multiple reflections, its adaptive cancellation is obtained through time-varying filtering, compensating inaccuracies in given approximate templates. The under-determined problem can then be formulated as a convex optimization one, providing estimates of both filters and primaries. Within this framework, the criterion to be minimized mainly consists of two parts: a data fidelity term and hard constraints modeling a priori information. This formulation may avoid, or at least facilitate, some parameter determination tasks, usually difficult to perform in inverse problems. Not only classical constraints, such as sparsity, are considered here, but also constraints expressed through hyperplanes, onto which the projection is easy to compute. The latter constraints lead to improved performance by further constraining the space of geophysically sound solutions.Comment: International Conference on Acoustics, Speech and Signal Processing (ICASSP 2014); Special session "Seismic Signal Processing

A Primal-Dual Proximal Algorithm for Sparse Template-Based Adaptive Filtering: Application to Seismic Multiple Removal

Unveiling meaningful geophysical information from seismic data requires to deal with both random and structured "noises". As their amplitude may be greater than signals of interest (primaries), additional prior information is especially important in performing efficient signal separation. We address here the problem of multiple reflections, caused by wave-field bouncing between layers. Since only approximate models of these phenomena are available, we propose a flexible framework for time-varying adaptive filtering of seismic signals, using sparse representations, based on inaccurate templates. We recast the joint estimation of adaptive filters and primaries in a new convex variational formulation. This approach allows us to incorporate plausible knowledge about noise statistics, data sparsity and slow filter variation in parsimony-promoting wavelet frames. The designed primal-dual algorithm solves a constrained minimization problem that alleviates standard regularization issues in finding hyperparameters. The approach demonstrates significantly good performance in low signal-to-noise ratio conditions, both for simulated and real field seismic data

β-NMF AND SPARSITY PROMOTING REGULARIZATIONS FOR COMPLEX MIXTURE UNMIXING. APPLICATION TO 2D HSQC NMR

International audienceIn Nuclear Magnetic Resonance (NMR) spectroscopy, an efficient analysis and a relevant extraction of different molecule properties from a given chemical mixture are important tasks, especially when processing bidimensional NMR data. To that end, using a blind source separation approach based on a vari-ational formulation seems to be a good strategy. However, the poor resolution of NMR spectra and their large dimension require a new and modern blind source separation method. In this work, we propose a new variational formulation for blind source separation (BSS) based on a β-divergence data fidelity term combined with sparsity promoting regularization functions. An application to 2D HSQC NMR experiments illustrates the interest and the effectiveness of the proposed method whether in simulated or real cases

Hilbert pairs of M-band orthonormal wavelet bases

International audienceRecently, there has been a growing interest for wavelet frames corresponding to the union of an orthonormal wavelet basis and its dual Hilbert transformed wavelet basis. However, most of the existing works specifically address the dyadic case. In this paper, we consider orthonormal M-band wavelet decompositions, since we are motivated by their advantages in terms of frequency selectivity and symmetry of the analysis functions, for M > 2. More precisely, we establish phase conditions for a pair of critically subsampled M-band filter banks. The conditions we obtain generalize a previous result given in the two-band case. We also show that, when the primal filter bank and its wavelets have symmetry, it is inherited by their duals. Furthermore, we give a design example where the number of vanishing moments of the approximate dual wavelets is imposed numerically to be the same as for the primal ones

Bancs de filtres et méthodes proximales pour la restauration d'images

National audienceLes algorithmes proximaux parallèles et les méthodes de directions alternées des multiplicateurs sont devenus populaires pour la résolution de problèmes inverses. En particulier, de nombreux travaux se sont intéressés à la résolution de problèmes de restauration dans un cadre variationnel convexe utilisant des trames. Jusqu'à présent, la plupart de ces méthodes nécessitaient une hypothèse de trames ajustées. Dans ce travail, nous relâchons cette contrainte en considérant des bancs de filtres à reconstruction parfaite non-nécessairement décimés de manière critique. Nous illustrons l'intérêt de telles trames sur un exemple de déconvolution en présence de bruit de Poisson

Sparse signal recovery using a Bernoulli generalized Gaussian prior

International audienceBayesian sparse signal recovery has been widely investigated during the last decade due to its ability to automatically estimate regularization parameters. Prior based on mixtures of Bernoulli and continuous distributions have recently been used in a number of recent works to model the target signals , often leading to complicated posteriors. Inference is therefore usually performed using Markov chain Monte Carlo algorithms. In this paper, a Bernoulli-generalized Gaussian distribution is used in a sparse Bayesian regularization framework to promote a two-level flexible sparsity. Since the resulting conditional posterior has a non-differentiable energy function , the inference is conducted using the recently proposed non-smooth Hamiltonian Monte Carlo algorithm. Promising results obtained with synthetic data show the efficiency of the proposed regularization scheme